A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
نویسندگان
چکیده
منابع مشابه
A class of polynomially solvable linear complementarity problems
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the defining matrix is nondegenerate and for which the n-step property holds. In this paper we consider an extension of the property to the degenerate case by introducing the concept of an extended n-step vector and matrix. It i...
متن کاملPolynomially solvable formulations for a class of nurse rostering problems
Identifying underlying structures in combinatorial optimisation problems leads to a better understanding of a problem and, consequently, to efficient solution methodologies. The present paper introduces a new network flow formulation for a large class of nurse rostering problems. By solving an integer minimum cost flow problem in a carefully constructed network, nurses’ shift schedules can be c...
متن کاملPolynomially solvable personnel rostering problems
Personnel rostering is a personnel scheduling problem in which shifts are assigned to employees, subject to complex organisational and contractual time-related constraints. Academic advances in this domain mainly focus on solving specific variants of this problem using intricate exact or (meta)heuristic algorithms, while little attention has been devoted to studying the underlying structure of ...
متن کاملInverse Bin-Packing Number Problems: Polynomially Solvable Cases
Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the itemsize vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012 ). In this paper, we investigate some special c...
متن کاملA Class of Solvable Consistent Labeling Problems
The structural description ansatz often used for representing and recognizing complex objects leads to the consistent labeling problem or to some optimization problems on labeled graphs. Although this problems are NP-complete in general it is well known that they are easy solvable if the underlying graph is a tree or even a partial m-tree (i.e its treewidth is m). On the other hand the underlyi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1987
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1987210201051